Latency Equalization: A Routing Service for Interactive Applications
نویسندگان
چکیده
Multi-party interactive network applications such as teleconferencing, network gaming and online trading are gaining popularity. In addition to end-to-end latency bounds, these applications require that the perceived delay difference among multiple users of the service is minimized. We propose a Latency EQualization (LEQ) service for interactive network applications, which equalizes the perceived latency for all users of an application. To scalably and effectively implement LEQ service, network support is essential. We propose to deploy a few hubs in provider networks to redirect the packets of interactive applications through routes with similar end-to-end delay. We formulate the hub placement problem, prove its NP hardness, and provide a greedy algorithm to solve this problem. Through extensive simulations, we show that our LEQ hubrouting architecture significantly reduces delay difference in large network topologies. The LEQ architecture is incrementally deployable in today’s networks, requiring only a few nodes to be modified to perform the LEQ service.
منابع مشابه
Minimizing End – to – End Delay in Multiparty Network Applications
In these days interaction between different network applications are becoming more popular and to improve the speed and datatransfer rate delay difference between the multynetworks should minimize. In this paper we propose a Latency EQualization (LEQ) service, which equalizes the perceived latency for all clients participating in an interactive network application. The few routers used in LEQ c...
متن کاملSupport of Multimedia Sip Applications over Manet: Service Discovery and Networking Architecture
This paper presents network architecture options along with their service discovery mechanisms, enabling realtime interactive multimedia session applications using the Internet Engineering Task Force’s (IETF) standard Session Initiation Protocol (SIP) in MANET. Two SIP MANET networking architectures are presented, both with and without a SIP proxy/registrar service. Effectively integrated into ...
متن کاملImproving Success Ratio in Multi-Constraint Quality of Service Routing
Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...
متن کاملA Reliable Routing Algorithm for Delay Sensitive Data in Body Area Networks
Wireless body Area networks (WBANs) include a number of sensor nodes placed inside or on the human body to improve patient health and quality of life. Ensuring the transfer and receipt of data in sensitive data is a very important issue. Routing algorithms should support a variety of service quality such as reliability and delay in sending and receiving data. Loss of information or excessive da...
متن کاملCyclic Routing in Peer-to-Peer Systems
Basic P2P routing algorithms require log(n) hops to route a message in a geographically distributed network. High latency of basic P2P routes is often unacceptable for delay-sensitive applications such as interactive browsing. Additional routing information at a node could help to reduce the latency at an expense of larger routing tables. We propose cyclic routing as a new approach to balance t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009